Measuring directed triadic closure with closure coefficients

Bistability through Triadic Closure

We propose and analyse a class of evolving network models suitable for describing a dynamic topological structure. Applications include telecommunication, on-line social behaviour and information processing in neuroscience. We model the evolving network as a discrete time Markov chain, and study a very general framework where, conditioned on the current state, edges appear or disappear independ...

Lazy Directed Congruence Closure

Directed closure measures for networks with reciprocity

The study of triangles in graphs is a standard tool in network analysis. Real-world networks are often directed and have a significant fraction of reciprocal edges. Direction leads to many complexities, and it can be difficult to “measure” this structure meaningfully. We propose a collection of directed closure values that are analogues of the classic transitivity measure (the fraction of wedge...

?????? Partial Closure ????? ?? ????? ????? ? ??? ??? ?? ???????? ?? ????? ?????????

This article has no abstract.

Flow-Directed Lightweight Closure Conversion

This paper presents a lightweight closure-conversion method that is driven by the results of wholeprogram interprocedural flow, reachability, points-to, and escape analyses. The method has been implemented and evaluated as part of a complete Scheme compiler. When compared with a baseline closure-conversion method that does no optimization, as well as conventional closureconversion methods that ...